Split Restrained Dominating Set of an Interval Graph using an Algorithm
نویسندگان
چکیده
منابع مشابه
Minimum 2-Tuple Dominating Set of an Interval Graph
The k-tuple domination problem, for a fixed positive integer k, is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The case when k 2 is called 2-tuple domination problem or double domination problem. In this paper, the 2-tuple domination problem is studied on interval graphs from an algorithmic point of view, which takes ...
متن کاملINTEGRABILITY OF AN INTERVAL-VALUED MULTIFUNCTION WITH RESPECT TO AN INTERVAL-VALUED SET MULTIFUNCTION
Intervals are related to the representation of uncertainty. In this sense, we introduce an integral of Gould type for an interval-valued multifunction relative to an interval-valued set multifunction, with respect to Guo and Zhang order relation. Classicaland specific properties of this new type of integral are established and several examples and applications from multicriteria decision making...
متن کاملAn Algorithm to find a Minimum Feedback Vertex Set of an Interval Graph
In an undirected graph, the feedback vertex set problem is to find a set of vertices of minimum cardinality whose removal makes the graph acyclic (connected or disconnected). This problem is known to be NP-hard for general graph. In this paper, we proposed two algorithms for finding the minimum feedback vertex set on interval graphs. The first algorithm is for unweighted case and takes O(n + m)...
متن کاملAn Order-based Algorithm for Minimum Dominating Set with Application in Graph Mining
Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLSo) algorithm to solve minimum dominating set problem in large graphs. Experimental evaluation is presented for multiple types of problem instances. These instances include unit disk graphs, which represent a model of wireles...
متن کاملAn Exact Algorithm for Connected Red-Blue Dominating Set
In the Connected Red-Blue Dominating Set problem we are given a graph G whose vertex set is partitioned into two parts R and B (red and blue vertices), and we are asked to find a connected subgraph induced by a subset S of B such that each red vertex of G is adjacent to some vertex in S. The problem can be solved in O(2) time by reduction to the Weighted Steiner Tree problem. Combining exhausti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Information Systems
سال: 2012
ISSN: 2249-0868
DOI: 10.5120/ijais12-450751